搜索资源列表
MST_47702
- 图的深度广度遍历和最小生成树PRIM和KRUSCA-Depth breadth traversal of the graph and the minimum spanning tree PRIM and KRUSCA, ....
Prim-algorithm
- 此代码用VC6.0开发,包含全部代码,内容为用prim算法实现最小生成树。-The VC6.0 development of this code contains all the code, the content of prim algorithm to achieve the minimum spanning tree.
Prim-for-minimum-spanning-tree
- 对给定的网和起点,实现求解最小生成树的Prim算法-Prim algorithm for solving the minimum spanning tree of a given network and the starting point
Prim
- prim算法,用c++程序实现,可以解决图论的最小生成树问题-prim algorithm which can solove the graph theory with c++
Matlab-algorithm-important
- 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等,带有源程序和中文说明文档,此文件夹中的文件,如需被利用,则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and mini
prim
- prim算法,输出最小生成树,时间复杂度Nlog(n)-prim algorithm
prim
- matlab算最小生成树经典算法prim s算法。-prim s argorism
prim
- 假设G=(V,E)是连通的,TE是G上最小生成树中边的集合。算法从U={u0}(u0∈V)、TE={}开始。重复执行下列操作: 在所有u∈U,v∈V-U的边(u,v)∈E中找一条权值最小的边(u0,v0)并入集合TE中,同时v0并入U,直到V=U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
prim
- 数据结构与算法的经典例题, 求最小生成树的算法之一, prim算法。-Data Structures and Algorithms classic example, find the minimum spanning tree algorithms, prim algorithm.
Prim
- 陈晓东 计算机算法与设计 最小生成树的Prim算法-Daniel and design of computer algorithms Prim minimum spanning tree algorithm
prim
- 求最小生成树的vc++工程,特别是在物流中心选择,铺设网络设施等领域,确定最佳连通关系,很有用-a vc++ project for a min generate tree
prim
- 利用Matlab编写构造最小生成树的Prim算法,程序注释清晰,通俗易懂。-Minimal Spanning Tree-- Prim
prim
- 利用C++编写最小生成树的Prim算法,程序思路很清晰,让人一目了然。-Minimal Spanning Tree
prim
- prim算法输出一个最小生成树,prim算法最先是找到一个根节点,然后在继续生成最小生成树,这样就能找到一个最小生成树,如果是这样的话,我们可以用一个循环,把每一个节点当作根节点,再把重复的树删除,这样就能找到所有的最小生成树了-algorithm prim, prim algorithm was first to find a root node, and then continue to generate the minimum spanning tree, so that we can f
Prim
- Prim算法,解决最小生成树问题,是图论中一个很重要的算法-Prim algorithm to solve the minimum spanning tree problem is a very important graph theory algorithms
prim
- 无向图应用问题 任务:如果以五向网表示n个城市之间通信网络的建设计划,顶点表示城市,边上的权表示该线路的造价,设计一个方案,使这个通讯网的总造价最低。 提示:这是一个求最小生成树的问题。n个城市名和各边的权值由用户输入,建立图的邻接矩阵,然后以Prim算法来求最小生成树,然后输出方案。 - The application of an undirected graph Task: If the five-way communications network, said ne
Prim
- 输入任意的一个网,用普里姆(Prim)算法构造最小生成树。-Enter any of a network, with Prim (Prim) minimum spanning tree algorithm.
Prim-And-Dijkstra
- 这个程序是图的综合操作中的最小生成树中普利姆算法和最短路径迪杰斯特拉算法的代码!-This program is a comprehensive diagram of the operation of the minimum spanning tree algorithm and plym Dijkstra shortest path algorithm code!
prim
- 用prim算法,构造最小生成树,用在数学建模的图论模型中-to use prim to produce the tree
prim
- 给定一个地区的n个城市间的距离网,用Prim算法或Kreskas算法建立最小生成树,并计算得到的最小生成树的代价。-Prim minimum spanning tree